@article{Gerdemann:2010,
    title={Suffix and Prefix Arrays for Gappy Phrase Extraction},
    author={Gerdemann, Dale},
    year={2010}
}

@article{DBLP:journals/siamcomp/ManberM93,
	Author = {Udi Manber and Eugene W. Myers},
	Journal = {SIAM J. Comput.},
	Number = {5},
	Pages = {935-948},
	Title = {Suffix Arrays: A New Method for On-Line String Searches},
	Volume = {22},
	Year = {1993}
}

@article{DBLP:journals/jda/AbouelhodaKO04,
	Author = {Mohamed Ibrahim Abouelhoda and Stefan Kurtz and Enno Ohlebusch},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Journal = {J. Discrete Algorithms},
	Number = {1},
	Pages = {53-86},
	Title = {Replacing suffix trees with enhanced suffix arrays},
	Volume = {2},
	Year = {2004}
}

@article{DBLP:journals/algorithmica/KimKP08,
	Author = {Dong Kyue Kim and Minhwan Kim and Heejin Park},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Journal = {Algorithmica},
	Number = {3},
	Pages = {350-377},
	Title = {Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays},
	Volume = {52},
	Year = {2008}
}

@article{Karkkainen:2006,
	Address = {New York, NY, USA},
	Author = {K\"{a}rkk\"{a}inen, Juha and Sanders, Peter and Burkhardt, Stefan},
	Issn = {0004-5411},
	Issue = {6},
	Journal = {J. ACM},
	Month = {November},
	Numpages = {19},
	Pages = {918--936},
	Publisher = {ACM},
	Title = {Linear work suffix array construction},
	Volume = {53},
	Year = {2006}
}

@inproceedings{DBLP:conf/cpm/KasaiLAAP01,
	Author = {Toru Kasai and Gunho Lee and Hiroki Arimura and Setsuo Arikawa and Kunsoo Park},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Booktitle = {CPM},
	Pages = {181-192},
	Title = {Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications},
	Year = {2001}
}

@inproceedings{DBLP:conf/focs/Weiner73,
    author    = {Peter Weiner},
    title     = {Linear Pattern Matching Algorithms},
    year      = {1973},
    pages     = {1-11},
    publisher = {IEEE},
    booktitle = {14th Annual Symposium on Switching and Automata Theory}
}

@article{McCreight:1976:SST:321941.321946,
    author = {McCreight, Edward M.},
    title = {A Space-Economical Suffix Tree Construction Algorithm},
    journal = {J. ACM},
    volume = {23},
    issue = {2},
    month = {April},
    year = {1976},
    issn = {0004-5411},
    pages = {262--272},
    numpages = {11},
    publisher = {ACM},
    address = {New York, NY, USA}
} 

@article{ukkonen1995:suffix,
	Author = {Ukkonen, Esko},
	Journal = {Algorithmica},
	Number = {3},
	Pages = {249--260},
	Title = {{On-Line Construction of Suffix Trees}},
	Volume = {14},
	Year = {1995}
}

@inproceedings{Mcnamee:2006,
	Author = {Paul Mcnamee and James Mayfield},
	Booktitle = {Proceedings of the 7th Conference of the Association for Machine Translation in the Americas},
	Pages = {100--109},
	Title = {Translation of Multiword Expressions Using Parallel Suffix Arrays},
	Year = {2006}
}

@article{Yamamoto:2001:USA:972778.972779,
	Acmid = {972779},
	Address = {Cambridge, MA, USA},
	Author = {Yamamoto, Mikio and Church, Kenneth W.},
	Issn = {0891-2017},
	Issue = {1},
	Issue_Date = {March 2001},
	Journal = {Comput. Linguist.},
	Month = {March},
	Numpages = {30},
	Pages = {1--30},
	Publisher = {MIT Press},
	Title = {Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus},
	Volume = {27},
	Year = {2001}
}

@inproceedings{Zhang05anefficient,
	Author = {Ying Zhang and Stephan Vogel},
	Booktitle = {In Proceedings of the 10th Conference of the European Association for Machine Translation (EAMT-05},
	Pages = {30--31},
	Title = {An efficient phrase-to-phrase alignment model for arbitrarily long phrase and large corpora},
	Year = {2005}
}

@book{widdows04geometry,
	Address = {Stanford, CA, USA},
	Author = {Dominic Widdows},
	Isbn = {1575864487},
	Publisher = {CLSI Publications},
	Title = {Geometry and Meaning},
	Year = {2004}
}

@TECHREPORT{Burrows94ablock-sorting,
    author = {M. Burrows and D. J. Wheeler and M. Burrows and D. J. Wheeler},
    title = {A block-sorting lossless data compression algorithm},
    institution = {DEC Systems Research Center, Palo Alto, California},
    year = {1994}
}

@book{adjeroh08bwt,
	Author = {Donald Adjeroh, Timothy Bell and Amar Mukherjee},
	Publisher = {Springer},
	Title = {The Burrows-Wheeler transform: data compression, suffix arrays, and pattern matching},
	Year = {2008}
}

@article{DBLP:journals/corr/abs-1003-1141,
	Author = {Peter D. Turney and Patrick Pantel},
	Bibsource = {DBLP, http://dblp.uni-trier.de},
	Ee = {http://arxiv.org/abs/1003.1141},
	Journal = {CoRR},
	Title = {From Frequency to Meaning: Vector Space Models of Semantics},
	Volume = {abs/1003.1141},
	Year = {2010}
}

@article{Apostolico2009227,
	Author = {Alberto Apostolico and Giorgio Satta},
	Issn = {1570-8667},
	Journal = {Journal of Discrete Algorithms},
	Note = {Selected papers from the 2nd Algorithms and Complexity in Durham Workshop ACiD 2006},
	Number = {2},
	Pages = {227 - 238},
	Title = {Discovering subword associations in strings in time linear in the output size},
	Volume = {7},
	Year = {2009}
}

@book{DBLP:books/daglib/0020103,
    author    = {Maxime Crochemore and Christophe Hancart and Thierry Lecroq},
    title     = {Algorithms on strings},
    publisher = {Cambridge University Press},
    year      = {2007},
    isbn      = {978-0-521-84899-2},
    pages     = {I-VIII, 1-383}
}

@book{DBLP:books/cu/Gusfield1997,
    author    = {Dan Gusfield},
    title     = {Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology},
    publisher = {Cambridge University Press},
    year      = {1997},
    isbn      = {0-521-58519-8}
}

@book{DBLP:books/daglib/0001349,
    author    = {Lloyd N. Trefethen and David Bau},
    title     = {Numerical linear algebra},
    publisher = {SIAM},
    year      = {1997},
    isbn      = {978-0-89871-361-9},
    pages     = {I-XII, 1-361}
}

@book{Meyer:2000:MAA:343374,
    editor = {Meyer, Carl D.},
    title = {Matrix analysis and applied linear algebra},
    year = {2000},
    isbn = {0-89871-454-0},
    publisher = {Society for Industrial and Applied Mathematics},
    address = {Philadelphia, PA, USA}
}

@book{citeulike:1305383,
    author = {Poole, David},
    day = {24},
    howpublished = {Hardcover},
    isbn = {0534998453},
    month = jan,
    publisher = {Brooks Cole},
    title = {Linear Algebra: A Modern Introduction (with CD-ROM)},
    year = {2005}
}

@book{Hogben:2006,
    author = {Hogben, Leslie},
    day = {02},
    edition = {1},
    howpublished = {pdf},
    isbn = {1584885106},
    month = nov,
    publisher = {Chapman \& Hall/CRC},
    series = {(Discrete Mathematics and Its Applications)},
    title = {Handbook of Linear Algebra},
    year = {2006}
}

@book{SMT:Koehn2010,
    author    = {Koehn, Philipp},
    title     = {Statistical Machine Translation},
    publisher = {Cambridge University Press},
    edition = {1},
    isbn = {978-0-521-87415-1},
    year      = {2010}
}

@inproceedings{koehn2005epc,
    address = {Phuket, Thailand},
    author = {Philipp Koehn},
    booktitle = {Conference Proceedings: the tenth Machine Translation Summit},
    organization = {AAMT},
    pages = {79--86},
    publisher = {AAMT},
    title = {Europarl: A Parallel Corpus for Statistical Machine Translation},
    year = {2005}
}

@book{Salton:1971:SRS:1102022,
    author = {Salton, G.},
    title = {The SMART Retrieval System\&\#8212;Experiments in Automatic Document Processing},
    year = {1971},
    publisher = {Prentice-Hall, Inc.},
    address = {Upper Saddle River, NJ, USA}
} 

@article{deerwester90indexing,
    author = {Scott C. Deerwester and Susan T. Dumais and Thomas K. Landauer and George W. Furnas and Richard A. Harshman},
    journal = {Journal of the American Society of Information Science},
    pages = {391-407},
    title = {Indexing by Latent Semantic Analysis},
    volume = {41},
    year = {1990}
}


